A nondeterministic space-time tradeoff for linear codes
نویسندگان
چکیده
منابع مشابه
A nondeterministic space-time tradeoff for linear codes
We consider nondeterministic D-way branching programs computing functions f : D → {0, 1} in time at most kn. In the boolean case, where D = {0, 1}, no exponential lower bounds are known even for k = 2. Ajtai has proved such lower bounds for explicit functions over domains D of size at least n, and Beame, Saks and Thathachar for explicit functions over domains of size at least 2 k . In this note...
متن کاملSuper-linear time-space tradeoff lower bounds for randomized computation
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques are an extension of those used by Ajtai 14, 51 in his time-space tradeoffs for deterministic RAM algorithms computing element distinctness and for...
متن کاملOn the Time-Space Tradeoff for Sorting with Linear Queries
Extending a result of Borodin, et. al. [l], we show that any branching program using linear queries " rhixi: c " to sort n numibers i ⌧pp l **,⌧n must satisfy the time-space tradeoff relation TS = n(n*) , The same relation is also shown to be true for branching programs that uses queries " min R = ? " where R is any subset of {xl,x2,...,xnj .
متن کاملExplicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff
A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that can be simultaneously achieved by a space-time (ST) block code. This tradeoff is precisely known in the case of i.i.d. Rayleigh-fading, for T ≥ nt + nr − 1 ...
متن کاملLinear Scalable Space-time Codes: Tradeoff between Spatial Multiplexing and Transmit Diversity
Using a class of recently proposed linear scalable space-time codes we demonstrate the tradeoff between spatial multiplexing and transmit diversity for Rayleigh and Ricean flat fading. The codes are able to use jointly transmit diversity in combination with spatial multiplexing, and they achieve spatial and temporal diversity in Rayleigh and Rice fading environments. Frequency diversity of freq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2009
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2008.11.001